| 1. | A member of the herbrand base is called atom in automatic theorem proving
在自动定理证明中,海尔勃朗基的成员也称为原子。 |
| 2. | A new method based on numeric computation for automated geometric theorem proving and discovering is shown
摘要该文提出了利用数值方法进行几何定理自动搜索的方法，并基于此方法开发了几何定理动态搜索系统。 |
| 3. | Singapore : world scientific , 1994 . 4 li h , wu y . automated theorem proving in projective geometry with cayley and bracket algebras
其中特征列方法是定理机器证明与方程求解的基础，也是数学机械化领域目前研究的核心内容。 |
| 4. | An convergence theorem proved and in order to speed convergence of working - set algorithm , constrained matrix derived from abs in working - set method corrected
为提高算法的收敛速度，对工作集算法中由abs算法生成的约束阵进行了校正 |
| 5. | In this paper , we do two things . first , for theorem proving problem such like ( vx ) ( 3y ) p ( x , y ) , we present a method for extracting procedure from the proofs generated by the resolution principle
) y ) p ( x ， y )的定理证明问题，本文从分析归结证明树中的每个节点入手，提取归结证明的过程信息，生成一个程序。 |
| 6. | In 1989 , academician wu wen - tsun forwards wu differential characteristic method which establish theoretical basis for mechanical theorem proving of differential geometry and the research of automatic reasoning
1989年吴文俊院士提出了吴?微分特征列法，为微分几何定理的机械化证明和自动推理的理论研究奠定了理论基础。 |
| 7. | 6 wu w t . basic principles of mechanical theorem proving in geometries . volume i : part of elementary geometries , beijing : science press , 1984 ; springer 1994 . 7 wu w t . mathematics mechanization
2提供了一种基于吴方法的增元消元法的求解方程组独立个数的数学新思路，不仅可以被数学领域而且可以被工程领域里的研究人员所借鉴。 |
| 8. | 1 wu w t . on the decision problem and the mechanization of theorem - proving in elementary geometry . scientia sinica , 1978 , : 159 - 172 . re - published in em automated theorem proving : after 25 years , 1984 , pp . 213 - 234
本文第一作者于上世纪七十年代末开始从事数学机械化研究，致力于实现推理与方程求解的自动化，并创立了几何定理机器证明的吴方法与方程求解的特征列方法。 |
| 9. | In proposbonal calculus , the processing ofresoluhon pdriciple have combination explosion naturally so , how to eltw combinaion explosion in the processing of resolution ( genetal showed computationaily hard problem ) is an in1portan subject in automated theorem proving
命题逻辑系统中的归结原理本质上存在组合问题，因此，如何避免组合问题(通常以计算复杂性的形式出现)是自动推理研究中的一个重要课题。 |
| 10. | Secondly , definitions of a extended bethe tree , bethe tree and cayley tree are introduced . further , the even - odd markov chain fields and markov chain fields indexed by a extended bethe tree , bethe tree and cayley tree are defined . subsequently the strong limit theorems proved above are applied to the study of all kinds of even - odd markov chain fields and markov chain fields defined above , which both extend the conclusions in [ 30 ] and [ 39 ] and prove a class of strong limit theorems for the even - odd markov chain fields and markov chain fields . as corollaries , we obtain some strong limit theorems for the frequencies of occurrence of states and ordered couples of states for the even - odd markov chain fields and markov chain fields . lastly , some coarse estimates are gained about the state occurrence frequencies for all kinds of even - odd markov chain fields and markov chain fields defined in the paper
然后把前面所证得的一类强极限定理应用到本文中所定义的各种奇偶马尔可夫链场、马尔可夫链场的研究工作中，从而推广了[ 30 ]和[ 39 ]中的结论，获得了本论文中所定义的各种奇偶马尔可夫链场、马尔可夫链场的一类强极限定理。作为这一类强极限定理的推论得到了状态和状态序偶出现频率的一类强极限定理。最后，给出了本论文中所定义的各种奇偶马尔可夫链场、马尔可夫链场上状态出现频率的若干粗略估计。 |
